Polling Models with Threshold Switching
نویسندگان
چکیده
We consider a model of two M/M/1 queues, served by a single server. The service policy for this polling model is of threshold type: the server serves queue 1 exhaustively, and does not remain at an empty queue if the other one is non-empty. It switches from queue 2 to queue 1 when the size of the latter queue reaches some level T , either preemptively or non-preemptively. All switches are instantaneous. We determine the joint queue length distribution, both using analytic techniques and using the power series algorithm.
منابع مشابه
Periodicity in the Transient Regime of Exhaustive Polling Systems
We consider an exhaustive polling system with three nodes in its transient regime under a switching rule of generalized greedy type. We show that, for the system with Poisson arrivals and service times with finite second moment, the sequence of nodes visited by the server is eventually periodic almost surely. To do this, we construct a dy-namical system, the triangle process, which we show has ...
متن کاملGated{type Polling Systems with Walking and Switch-in Times
We consider models of polling systems where switching times between channels are composed of two parts: walking times required to move from one channel (station) to another, and switch-in times that are incurred only when the server enters a station to render service. We analyze three Gated-type systems: (i) Cyclic polling with Gated regime, (ii) Cyclic polling with Globally-Gated regime, and (...
متن کاملOn the optimal control of a two-queue polling model
This paper deals with two M/M/1 queues served by a single server with threshold switching. Our main goal is to solve the Poisson equation and, as a result, give expressions for the long-run expected average cost of holding units and switching actions of the server, and the bias vector.
متن کاملTwo-Queue Polling Systems with Switching Policy Based on the Queue which is Not Being Served
We study a system of two non-identical and separate M/M/1/• queues with capacities (buffers) C1 < ∞ and C2 = ∞, respectively, served by a single server that alternates between the queues. The server’s switching policy is threshold-based, and, in contrast to other threshold models, is determined by the state of the queue that is not being served. That is, when neither queue is empty while the se...
متن کاملThreshold Variable Determination and Threshold Variable Driven Switching Autoregressive Models
In this paper we propose a new class of nonlinear time series models, the threshold variable driven switching autoregressive models. It is a hierarchical model that combines two important nonlinear time series models, the threshold autoregressive (AR) models and the random switching AR models. The underlying time series process switches between two (or more) different linear models. The switchi...
متن کامل